The Structure of Complex Networks
نویسنده
چکیده
THIS dissertation regards the structure of large complex networks. The dissertation is divided into three main parts. Part I contains chapters 1– 3. Part II contains chapters 4–6. Part III consists of the concluding chapter 7 and the bibliography. Part I serves as an introduction. Chapters 1 and 2 directed toward enabling a general reader to understand the concepts and nomenclature used in the research, presented in Part II of the dissertation. These chapters also motivate and explain the unifying idea behind the research contained in this dissertation. Chapter 3 describes the origin and general structure of the data set used in the subsequent chapters. Part II contains five papers that chronicle my research as a Ph.D.-student. • Chapter 4 consists of two papers: Life, Death, and Preferential Attachment [54] and Live and Dead Nodes [53] where a mathematical model of the network of scientific papers is motivated empirically and solved analytically. The model is an augmentation of the growing networks model, first introduced by Barabási and Albert [10]. In [53,54], the idea that network nodes can ‘die’, is introduced, and the associated consequences for the growth model are explored. Further, it is demonstrated that the mechanism for ‘node-death’, alone, can create networks with power-law degree distributions. • Chapter 5 concerns the longitudinal correlations, in the citation network, that is induced by the authors of the scientific papers. This chapter also contains two papers: Measures for Measures [56] and A Quantitative Analysis of Measures of Quality [57]. Here, Bayesian statistics are employed to analyze several different measures of quality. Using scaling arguments, it is demonstrated how many papers are needed to draw conclusions, regarding long-term scientific performance with usefully small statistical uncertainties. Further, the approach described here permits the value-free (i.e., statistical) comparison of scientists working in distinct areas of science. • Chapter 6 discusses the detection of communities in large networks, using deterministic mean field methods. Further, the paper, Deterministic Sune Lehmann Jørgensen 2007 Version: June 19, 2007 22:27 viii The Structure of Complex Networks Community Detection [52] presents an analytical analysis of a simple class of random networks, with adjustable community structure. Part III consists of a final, concluding chapter that recapitulates the main ideas, presented in this dissertation, and points towards new avenues for further research. Additionally, part III also contains the bibliography. Version: June 19, 2007 22:27 Sune Lehmann Jørgensen 2007 The Structure of Complex Networks ix
منابع مشابه
Synthesis, Characterization and Crystal Structure of Caffeine Complex of Mn(II) p-Hydroxybenzoate
A new manganese(II) complex containing p-hydroxybenzoate and caffeine ligands, namely [Mn(OH-C6H4COO)2(H2O)4].2(C8H10N4O2).8H2O has been prepared. The synthesized complex has been characterized by elemental analyses, FT-IR spectroscopy, X-ray crystallography, and m...
متن کاملPrediction of Red Mud Bound-Soda Losses in Bayer Process Using Neural Networks
In the Bayer process, the reaction of silica in bauxite with caustic soda causes the loss of great amount of NaOH. In this research, the bound-soda losses in Bayer process solid residue (red mud) are predicted using intelligent techniques. This method, based on the application of regression and artificial neural networks (AAN), has been used to predict red mud bound-soda losses in Iran Alumina C...
متن کاملSynchronization for Complex Dynamic Networks with State and Coupling Time-Delays
This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...
متن کاملCommunity Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملSynchronization analysis of complex dynamical networks with hybrid coupling with application to Chua’s circuit
Complex dynamic networks have been considered by researchers for their applications in modeling and analyzing many engineering issues. These networks are composed of interconnected nodes and exhibit complex behaviors that are resulted from interactions between these nodes. Synchronization, which is the concept of coordinated behavior between nodes, is the most interested behavior in these netwo...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007